Improvement of One Adaptive Oblivious Transfer Scheme

نویسندگان

  • Zhengjun Cao
  • Lihua Liu
چکیده

In 2011, the authors [8] presented an adaptive oblivious transfer (OT) scheme based on Decisional 3-Party Diffie-Hellman (3DDH) assumption. The encryption used in the scheme is a combination of the Boneh-Boyen IBE scheme and a variation of the Hohenberger-Waters signature. The scheme is somewhat inefficient since it combines the two underlying schemes in a simple way. In this paper, we present an improvement of the OT scheme and show its security under 3DDH assumption. The proposed skills are helpful for designing and analyzing other cryptographic schemes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improvement of Green-Hohenberger Adaptive Oblivious Transfer: A Review

In TCC’2011, Green and Hohenberger proposed an adaptive oblivious transfer (OT) scheme based on Decisional 3-Party Diffie-Hellman (3DDH) assumption. The encryption used in the scheme is a combination of Boneh-Boyen identity-based encryption and a variation of HohenbergerWaters signature. The OT scheme is somewhat inefficient because it combines the two underlying schemes in a very simple way wi...

متن کامل

Efficient k-Out-of-n Oblivious Transfer Schemes with Adaptive and Non-adaptive Queries

In this paper we propose a very efficient two-round k-out-of-n oblivious transfer scheme, in which R sends O(k) messages to S, and S sends O(n) messages back to R. The computation cost of R and S is reasonable as R needs O(k) operations and S needs O(n) operations. The choices of R are unconditionally secure and the secrecy of unchosen messages is guaranteed as well if the decisional bilinear D...

متن کامل

On Black-Box Complexity of Universally Composable Security in the CRS Model

In this work, we study the intrinsic complexity of black-box Universally Composable (UC) secure computation based on general assumptions. We present a thorough study in various corruption modelings while focusing on achieving security in the common reference string (CRS) model. Our results involve the following: • Static UC secure computation. Designing the first static UC secure oblivious tran...

متن کامل

On Black-Box Complexity of UC Security

In this work, we study the intrinsic complexity of black-box UC secure computation based on general assumptions. We present a thorough study in various corruption modelings while focusing on achieving security in the CRS model (and related setups). Our results involve the following: • Static UC secure computation. Designing the first static UC secure oblivious transfer protocol based on public-...

متن کامل

Improvement of Camenisch-Neven-Shelat Oblivious Transfer Scheme

In 2007, Camenisch, Neven and Shelat proposed an adaptive oblivious transfer (OT) in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other. In this paper, we show that the scheme has a drawback that the sender can only serve a single receiver only once. The drawback results from the deterministic encryption used. To fix it, we suggest to repla...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2013  شماره 

صفحات  -

تاریخ انتشار 2013